%0 Conference Proceedings
%4 dpi.inpe.br/vagner/1999/11.26.17.01
%2 sid.inpe.br/banon/2001/03.30.15.57.51
%@doi 10.1109/SIBGRA.1999.805592
%T An optimal algorithm to construct all voronoi diagrams for k nearest neighbor search in T2
%D 1999
%A Rezende, Pedro J. de,
%A Westrupp, Rodrigo B.,
%E Stolfi, Jorge,
%E Tozzi, Clésio Luis,
%B Brazilian Symposium on Computer Graphics and Image Processing, 12 (SIBGRAPI)
%C Campinas, SP, Brazil
%8 17-20 Oct. 1999
%I IEEE Computer Society
%J Los Alamitos
%P 7-15
%S Proceedings
%1 SBC - Brazilian Computer Society and UNICAMP - University of Campinas
%K t2, voronoi, euclidean, k.
%X In this paper, we generalize to the oriented projective plane T2 an algorithm for constructing all order k Voronoi diagram in the Euclidean plane. We also show that, for fixed K and for a finite set of sites, an order K Voronoi diagram in T2 has an exact number of regions. Furthermore, we show that the order K Voronoi diagram of a se of n sites in T2 is antipodal to its order n - K Voronoi diagram, VK: 1-< K < n.
%3 014-31421568.pdf
%O The conference was held in Campinas, SP, Brazil, from October 17 to 20.